Nonlinear Eigenvalue Problems with Specified Eigenvalues

نویسندگان

  • Michael Karow
  • Daniel Kressner
  • Emre Mengi
چکیده

This work considers eigenvalue problems that are nonlinear in the eigenvalue parameter. Given such a nonlinear eigenvalue problem T , we are concerned with finding the minimal backward error such that T has a set of prescribed eigenvalues with prescribed algebraic multiplicities. While the usual resolvent norm addresses this question for a single eigenvalue of multiplicity one, the general setting involving several eigenvalues is significantly more difficult. Under mild assumptions, we derive a singular value optimization characterization for the minimal perturbation that addresses the general case.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chebyshev interpolation for nonlinear eigenvalue problems

This work is concerned with numerical methods for matrix eigenvalue problems that are nonlinear in the eigenvalue parameter. In particular, we focus on eigenvalue problems for which the evaluation of the matrix valued function is computationally expensive. Such problems arise, e.g., from boundary integral formulations of elliptic PDE-eigenvalue problems and typically exclude the use of establis...

متن کامل

Solving Nonlinear Eigenvalue Problems using an Improved Newton Method

Finding approximations to the eigenvalues of nonlinear eigenvalue problems is a common problem which arises from many complex applications. In this paper, iterative algorithms for finding approximations to the eigenvalues of nonlinear eigenvalue problems are verified. These algorithms use an efficient numerical approach for calculating the first and second derivatives of the determinant of the ...

متن کامل

Restarting iterative projection methods for Hermitian nonlinear eigenvalue problems with minmax property

In this work we present a new restart technique for iterative projection methods for nonlinear eigenvalue problems admitting minmax characterization of their eigenvalues. Our technique makes use of the minmax induced local enumeration of the eigenvalues in the inner iteration. In contrast to global numbering which requires including all the previously computed eigenvectors in the search subspac...

متن کامل

Solving Nonlinear Eigenvalue Problems Using A Variant of Newton Method

In this paper, iterative algorithms for finding approximations to the eigenvalues of nonlinear algebraic eigenvalue problems are examined. These algorithms use an efficient numerical procedure for calculating the first and second derivatives of the determinant of the problem. Computational aspects of this procedure as applied to finding all the eigenvalues from a given complex-plane domain in a...

متن کامل

Continuation of eigenvalues and invariant pairs for parameterized nonlinear eigenvalue problems

Invariant pairs have been proposed as a numerically robust means to represent and compute several eigenvalues along with the corresponding (generalized) eigenvectors for matrix eigenvalue problems that are nonlinear in the eigenvalue parameter. In this work, we consider nonlinear eigenvalue problems that depend on an additional parameter and our interest is to track several eigenvalues as this ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Matrix Analysis Applications

دوره 35  شماره 

صفحات  -

تاریخ انتشار 2014